Linear codes with covering radius 3
نویسندگان
چکیده
The shortest possible length of a q-ary linear code of covering radius R and codimension r is called the length function and is denoted by q(r, R). Constructions of codes with covering radius 3 are here developed, which improve best known upper bounds on q(r, 3). General constructions are given and upper bounds on q(r, 3) for q = 3, 4, 5, 7 and r ≤ 24 are tabulated.
منابع مشابه
Linear codes with covering radius R = 2, 3 and codimension tR
Let [ ] denote a linear code over with length , codimension , and covering radius . We use a modification of constructions of [2 +1 2 3] 2 and [3 +1 3 5] 3 codes ( 5) to produce infinite families of good codes with covering radius 2 and 3 and codimension .
متن کاملOn a family of binary completely transitive codes with growing covering radius
A new family of binary linear completely transitive (and, therefore, completely regular) codes is constructed. The covering radius of these codes is growing with the length of the code. In particular, for any integer ρ ≥ 2, there exist two codes with d = 3, covering radius ρ and length ( 4 ρ 2 )
متن کاملOn linear completely regular codes with covering radius rho=1. Construction and classification
Completely regular codes with covering radius ρ = 1 must have minimum distance d ≤ 3. For d = 3, such codes are perfect and their parameters are well known. In this paper, the cases d = 1 and d = 2 are studied and completely characterized when the codes are linear. Moreover, it is proven that all these codes are completely transitive.
متن کاملConstructions and families of covering codes and saturated sets of points in projective geometry
In a recent paper by this author, constructions of linear binary covering codes are considered. In this work, constructions and techniques of the earlier paper are developed and modified for q-ary linear nonbinary covering codes, q 2 3, and new constructions are proposed. The described constructions design an infinite family of codes with covering radius R based on a starting code of the same c...
متن کاملNew Linear Codes with Covering Radius 2 and Odd Basis
On the way of generalizing recent results by Cock and the second author, it is shown that when the basis q is odd, BCH codes can be lengthened to obtain new codes with covering radius R = 2. These constructions (together with a lengthening construction by the first author) give new infinite families of linear covering codes with codimension r = 2k + 1 (the case q = 3, r = 4k + 1 was considered ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Des. Codes Cryptography
دوره 54 شماره
صفحات -
تاریخ انتشار 2010